An Adjacency Criterion for Coxeter Matroids
نویسنده
چکیده
A coxeter matroid is a generalization of matroid, ordinary matroid being the case corresponding to the family of Coxeter groups An , which are isomorphic to the symmetric groups. A basic result in the subject is a geometric characterization of Coxeter matroid in terms of the matroid polytope, a result first stated by Gelfand and Serganova. This paper concerns properties of the matroid polytope. In particular, a criterion is given for adjacency of vertices in the matroid polytope.
منابع مشابه
Lagrangian Matroids: Representations of Type Bn
Coxeter matroids are combinatorial objects associated with finite Coxeter groups; they can be viewed as subsets M of the factor set W/P of a Coxeter group W by a parabolic subgroup P which satisfy a certain maximality property with respect to a family of shifted Bruhat orders on W/P . The classical matroids of matroid theory are exactly the Coxeter matroids for the symmetric group Symn (which i...
متن کاملCoxeter matroid polytopes
If ∆ is a polytope in real affine space, each edge of ∆ determines a reflection in the perpendicular bisector of the edge. The exchange group W (∆) is the group generated by these reflections, and ∆ is a (Coxeter) matroid polytope if this group is finite. This simple concept of matroid polytope turns out to be an equivalent way to define Coxeter matroids. The GelfandSerganova Theorem and the st...
متن کاملThe Greedy Algorithm and Coxeter Matroids
The notion of matroid has been generalized to Coxeter matroid by Gelfand and Serganova. To each pair (W, P) consisting of a finite irreducible Coxeter group W and parabolic subgroup P is associated a collection of objects called Coxeter matroids. The (ordinary) matroids are a special case, the case W = An (isomorphic to the symmetric group Symn+1) and P a maximal parabolic subgroup. The main re...
متن کاملSymplectic Matroids
A symplectic matroid is a collection B of k-element subsets of J = {1, 2, . . . , n, 1∗, 2∗, . . . , n∗}, each of which contains not both of i and i∗ for every i ≤ n, and which has the additional property that for any linear ordering ≺ of J such that i ≺ j implies j∗ ≺ i∗ and i ≺ j∗ implies j ≺ i∗ for all i, j ≤ n, B has a member which dominates element-wise every other member of B. Symplectic ...
متن کاملOn exchange properties for Coxeter matroids and oriented matroids
We introduce new basis exchange axioms for matroids and oriented matroids. These new axioms are special cases of exchange properties for a more general class of combinatorial structures, Coxeter matroids. We refer to them as “properties” in the more general setting because they are not all equivalent, as they are for ordinary matroids, since the Symmetric Exchange Property is strictly stronger ...
متن کامل